Tree sign pattern matrices that require zero eigenvalues

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sign Pattern Matrices that Admit P0 Matrices

A P0-matrix is a real square matrix all of whose principle minors are nonnegative. In this paper, we consider the class of P0-matrix. Our main aim is to determine which sign pattern matrices are admissible for this class of real matrices. Keywords—Sign pattern matrices, P0 matrices, graph, digraph

متن کامل

Accurate eigenvalues of certain sign regular matrices

We present a new O(n3) algorithm for computing all eigenvalues of certain sign regular matrices to high relative accuracy in floating point arithmetic. The accuracy and cost are unaffected by the conventional eigenvalue condition numbers. A matrix is called sign regular when the signs of its nonzero minors depend only of the order of the minors. The sign regular matrices we consider are the one...

متن کامل

Spaces of Matrices with Several Zero Eigenvalues

Let V be an w-dimensional vector space over some field F, \F\ ^ n, and let SC be a space of linear mappings from V into itself {SC ^ Horn (V, V)) with the property that every mapping has at least r zero eigenvalues. If r = 0 this condition is vacuous but if r = 1 it states that SC is a space of singular mappings; in this case Flanders [1] has shown that d im#"^n(n — 1) and that if dim #" = n(n ...

متن کامل

Primitive Zero-Symmetric Sign Pattern Matrices with Zero Diagonal Attaining the Maximum Base

A sign pattern matrix or sign pattern A is a matrix whose entries are from the set {1,−1, 0}. Notice that for a square sign pattern matrixA, in the computation of the signs of the entries of the power A, an ambiguous sign may arise when a positive sign is added to a negative sign. So a new symbol # was introduced in 1 to denote such an ambiguous sign. The powers of a square sign pattern have be...

متن کامل

Sign patterns that require eventual exponential nonnegativity

Sign patterns that require exponential nonnegativity are characterized. A set of conditions necessary for a sign pattern to require eventual exponential nonnegativity are established. It is shown that these conditions are also sufficient for an upper triangular sign pattern to require eventual exponential nonnegativity and it is conjectured that these conditions are both necessary and sufficien...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Australian Mathematical Society

سال: 1997

ISSN: 0004-9727,1755-1633

DOI: 10.1017/s0004972700030550